package leetcode.easy;

import leetcode.base.TreeNode;

/**
 * ClassName: $111_MinDepth
 * Description:
 * date: 2021-11-18 22:24
 *
 * @author liyifan
 */
public class $111_MinDepth {
    public int minDepth(TreeNode root) {
        if (root == null)
            return 0;
        if (root.left == null && root.right != null)
            return 1 + minDepth(root.right);

        if (root.left != null && root.right == null)
            return 1 + minDepth(root.left);

        return 1 + Math.min(minDepth(root.left), minDepth(root.right));
    }
}
